Heuristic Di Acquiring in Lazy ReleaseConsistency
نویسندگان
چکیده
This paper presents a Heuristic Dii Acquiring (HDA) protocol in Lazy Release Consistency (LRC) based distributed shared memory (DSM) systems. Based on the run-time detection of associations between locks and data, the HDA can selectively piggy-back useful page diis in a lock grant message. By adopting the novel HDA protocol, an improved LRC model has been implemented, and the experimental results have been collected and analyzed. First, we introduce the Lazy Dii Acquiring (LDA) and Eager Dii Acquiring (EDA) protocols in the LRC based DSM systems. Second, we discuss the impact of LDA and EDA on the performance of the LRC-based DSM systems. Third, we propose the idea and implementation of the HDA protocol. Finally, we present and analyze the experimental results. From the experimental results, we conclude the HDA protocol can signiicantly improve the performance of LRC model.
منابع مشابه
Towards Rational Deployment of Multiple Heuristics in A*
The obvious way to use several admissible heuristics in A∗ is to take their maximum. In this paper we aim to reduce the time spent on computing heuristics. We discuss Lazy A∗, a variant of A∗ where heuristics are evaluated lazily: only when they are essential to a decision to be made in the A∗ search process. We present a new rational meta-reasoning based scheme, rational lazy A∗, which decides...
متن کاملToward Rational Deployment of Multiple Heuristics in A
The obvious way to use several admissible heuristics in A∗ is to take their maximum. In this paper we aim to reduce the time spent on computing heuristics. We discuss Lazy A∗, a variant of A∗ where heuristics are evaluated lazily: only when they are essential to a decision to be made in the A∗ search process. We present a new rational meta-reasoning based scheme, rational lazy A∗, which decides...
متن کاملRational Deployment of Multiple Heuristics in IDA
Recent advances in metareasoning for search has shown its usefulness in improving numerous search algorithms. This paper applies rational metareasoning to IDA* when several admissible heuristics are available. The obvious basic approach of taking the maximum of the heuristics is improved upon by lazy evaluation of the heuristics, resulting in a variant known as Lazy IDA*. We introduce a rationa...
متن کاملDynamic Cancellation: a Heuristic for Selecting Cancellation Strategies in Time Warp Simulators
The performance of Time Warp parallel discrete event simulators can be a ected by the cancellation strategy used to send anti-messages. Under aggressive cancellation, anti-message generation occurs immediately after a straggler message is detected. This results in quick termination of potentially incorrect computations (event processing) when out-of-order event processing occurs. In contrast, l...
متن کاملEfficiency issues in the RLF heuristic for graph coloring
This paper presents an efficient implementation of the well-known Recursive Largest First (RLF) algorithm of Leighton to find heuristic solutions to the classical graph coloring problem. The main features under study are a lazy computation of the induced vertex degree and the use of efficient data structures. Computational experiments show that the lazy feature leads to a novel implementation t...
متن کامل